Canonical duality for solving general nonconvex constrained problems
نویسندگان
چکیده
منابع مشابه
Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملCanonical Duality Theory and Solutions to Constrained Nonconvex Quadratic Programming
This paper presents a perfect duality theory and a complete set of solutions to nonconvex quadratic programming problems subjected to inequality constraints. By use of the canonical dual transformation developed recently, a canonical dual problem is formulated, which is perfectly dual to the primal problem in the sense that they have the same set of KKT points. It is proved that the KKT points ...
متن کاملNonconvex Semi-linear Problems and Canonical Duality Solutions
This paper presents a brief review and some new developments on the canonical duality theory with applications to a class of variational problems in nonconvex mechanics and global optimization. These nonconvex problems are directly related to a large class of semi-linear partial differential equations in mathematical physics including phase transitions, post-buckling of large deformed beam mode...
متن کاملAlgorithms for Solving Nonconvex Block Constrained Quadratic Problems
Non-convex Quadratically Constrained Quadratic Programs with block-separable convex constraints are generally NP-hard. These problems appear in many applications such as estimation and control, complex unimodular programming, and MAX-CUT type problems. SDP relaxation is the best known upper bound approximation for this problem. We suggest the Block Optimal Ascent (BOA) algorithm to obtain lower...
متن کاملOn Solving Nonconvex Optimization Problems by Reducing The Duality Gap
Lagrangian bounds, i.e. bounds computed by Lagrangian relaxation, have been used successfully in branch and bound bound methods for solving certain classes of nonconvex optimization problems by reducing the duality gap. We discuss this method for the class of partly linear and partly convex optimization problems and, incidentally, point out incorrect results in the recent literature on this sub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2015
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-015-0860-0